//package com.codeforces.cf584;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class C {
    Scanner in = new Scanner(System.in);
    void solve(){
        int t = in.nextInt();
        while(t-- > 0 ){
            int n = in.nextInt(),m = in.nextInt();
            char[][] arr = new char[n][m];
            for(int i = 0;i < n;i++){
                arr[i] = in.next().toCharArray();
            }
            List<int[]> ops = new ArrayList<>();
            for(int i = 0;i < n - 1;i++){
                for(int j = 0;j < m - 1;j++){
                    if(arr[i][j] != '0'){

                        int[] t1 = new int[6];
                        t1[0] = i + 1;
                        t1[1] = j + 1;
                        t1[2] = i + 1;
                        t1[3] = j + 2;
                        t1[4] = i + 2;
                        t1[5] = j + 1;
                        ops.add(t1);

                        int[] t2 = new int[6];
                        t2[0] = i + 1;
                        t2[1] = j + 1;
                        t2[2] = i + 1;
                        t2[3] = j + 2;
                        t2[4] = i + 2;
                        t2[5] = j + 2;
                        ops.add(t2);

                        int[] t3 = new int[6];
                        t3[0] = i + 1;
                        t3[1] = j + 1;
                        t3[2] = i + 2;
                        t3[3] = j + 1;
                        t3[4] = i + 2;
                        t3[5] = j + 2;
                        ops.add(t3);
                    }
                }
            }
            for(int i = 0;i < n - 1;i++){
                if(arr[i][m - 1] == '1'){
                    int[] t1 = new int[6];
                    t1[0] = i + 1;
                    t1[1] = m;
                    t1[2] = i + 1;
                    t1[3] = m - 1;
                    t1[4] = i + 2;
                    t1[5] =  m - 1;
                    ops.add(t1);

                    int[] t2 = new int[6];
                    t2[0] = i + 1;
                    t2[1] = m - 1;
                    t2[2] = i + 1;
                    t2[3] = m;
                    t2[4] = i + 2;
                    t2[5] = m;
                    ops.add(t2);

                    int[] t3 = new int[6];
                    t3[0] = i + 1;
                    t3[1] = m;
                    t3[2] = i + 2;
                    t3[3] = m - 1;
                    t3[4] = i + 2;
                    t3[5] = m;
                    ops.add(t3);
                }
            }
            for(int j = 0;j < m - 1;j++){
                if(arr[n - 1][j] == '1'){
                    int[] t1 = new int[6];
                    t1[0] = n;
                    t1[1] = j + 1;
                    t1[2] = n - 1;
                    t1[3] = j + 1;
                    t1[4] = n - 1;
                    t1[5] =  j + 2;
                    ops.add(t1);

                    int[] t2 = new int[6];
                    t2[0] = n - 1;
                    t2[1] = j + 2;
                    t2[2] = n;
                    t2[3] = j + 1;
                    t2[4] = n;
                    t2[5] = j + 2;
                    ops.add(t2);

                    int[] t3 = new int[6];
                    t3[0] = n - 1;
                    t3[1] = j + 1;
                    t3[2] = n;
                    t3[3] = j + 1;
                    t3[4] = n;
                    t3[5] = j + 2;
                    ops.add(t3);
                }
            }
            if(arr[n- 1][m - 1] == '1'){
                int[] t1 = new int[6];
                t1[0] = n;
                t1[1] = m;
                t1[2] = n - 1;
                t1[3] = m - 1;
                t1[4] = n;
                t1[5] = m - 1;
                ops.add(t1);

                int[] t2 = new int[6];
                t2[0] = n - 1;
                t2[1] = m - 1;
                t2[2] = n - 1;
                t2[3] = m ;
                t2[4] = n;
                t2[5] = m;
                ops.add(t2);

                int[] t3 = new int[6];
                t3[0] = n - 1;
                t3[1] = m;
                t3[2] = n;
                t3[3] = m;
                t3[4] = n;
                t3[5] = m - 1;
                ops.add(t3);
            }
            System.out.println(ops.size());
            for(int[] o : ops){
                for(int i : o){
                    System.out.print(i + " ");
                }
                System.out.println();
            }
        }
    }
    public static void main(String[] args) {
        C s = new C();
        s.solve();
    }
}
